package com.zhangxiaofanfan.hotcode.first;

/**
 * <a href="https://leetcode.cn/problems/longest-valid-parentheses/description/?envType=study-plan-v2&envId=top-100-liked">32. 最长有效括号</a>
 *
 * @date 2024-07-13 03:14:13
 * @author zhangxiaofanfan
 */
public class HotCode090 {
    public static void main(String[] args) {
        HotCode090 hotCode = new HotCode090();
        int[] nums = {2,3,-2,4};
        System.out.println(hotCode.longestValidParentheses(""));
    }

    public int longestValidParentheses(String s) {
        return  0;
    }
}